package leetcodeHis;

/**
 * 编写一个函数来查找字符串数组中的最长公共前缀。
 *
 * 如果不存在公共前缀，返回空字符串 ""。
 *
 * 示例 1:
 *
 * 输入: ["flower","flow","flight"]
 * 输出: "fl"
 *
 * 示例 2:
 *
 * 输入: ["dog","racecar","car"]
 * 输出: ""
 * 解释: 输入不存在公共前缀。
 */
public class Algo_14_最长公共前缀 {

    public static String longestCommonPrefix(String[] strs) {
        if(strs.length == 0 || strs[0].length() == 0) {
            return "";
        }
        if(strs.length == 1) {
            return strs[0];
        }
        int index =0;
        for (int j = 0; j < strs[0].length(); j++) {
            for (int i = 1; i < strs.length; i++) {

                if(j == strs[i].length()) {
                    return strs[0].substring(0, j);
                }
                if(strs[i].charAt(j) != strs[0].charAt(j)) {
                    return strs[0].substring(0, j);
                }
                index = j;
            }
        }
        return strs[0].substring(0, index+1);
    }



    public static void main(String[] args) {
        String[] arr1 = {"flower","flow","flight"};
        String[] arr2 = {"c","c"};
//        System.out.println(longestCommonPrefix(arr1));
        System.out.println(longestCommonPrefix(arr2));
    }

}
